deterministic search

Terms from Artificial Intelligence: humans at the heart of algorithms

A determinsitic search uses a fixed rule to decide the order in which to visit states in a {{search tree} or search graph, and thus will always search in the same order given the same data. In contrast a stochastic search may take different choices based on random chance.

Used on pages 56, 219

Also known as deterministic